ARKODE: A Flexible IVP Solver Infrastructure for One-step Methods
نویسندگان
چکیده
We describe the ARKODE library of one-step time integration methods for ordinary differential equation (ODE) initial-value problems (IVPs). In addition to providing standard explicit and diagonally implicit Runge--Kutta methods, also supports designed treat additive splittings IVP, including implicit-explicit (ImEx) multirate infinitesimal (MRI) methods. present role within SUNDIALS suite nonlinear solver libraries, core infrastructure utilities common large classes as well its use ``time stepper'' modules enabling easy incorporation novel algorithms into library. Numerical results show example increasing complexity, highlighting algorithmic flexibility afforded through this infrastructure, include a larger multiphysics application leveraging multiple features from SUNDIALS.
منابع مشابه
Theory and Methods for One -step Odes
where f is continuous and outputs an Rd vector. approximation on grid functions Let y(t) be the true solution. LetH be the grid dened by step-sizes: h1 , . . . , hN such that 0 < t1 < . . . < tN satises t i = ∑ l=1 h i .1 Let ∣H∣ = maxi h i . 1 is is just the obvious grid where h i = t i − t i−1 . We are parameterizing it by the step-sizes h i instead of times because h is what shows up in th...
متن کاملA Flexible Meta-solver Framework for Constraint Solver Collaboration
The solving of multi-domain constraint problems with the help of collaborating solvers has seen extended interest in recent years. We describe the implementation (Meta-S) and extension of a previously proposed theoretical framework of cooperating constraint solvers. Meta-S allows the dynamic integration of arbitrary external (stand-alone) solvers to enable the collaborative processing of constr...
متن کاملBlock Implicit One - Step Methods
A class of one-step methods which obtain a block of r new values at each step are studied. The asymptotic behavior of both implicit and predictor-corrector procedures is examined.
متن کاملA Constraint Solver for Flexible Protein Models
This paper proposes the formalization and implementation of a novel class of constraints aimed at modeling problems related to placement of multi-body systems in the 3-dimensional space. Each multi-body is a system composed of body elements, connected by joint relationships and constrained by geometric properties. The emphasis of this investigation is the use of multi-body systems to model nati...
متن کاملA Flexible Solver for Finite Arithmetic Circuits
Arithmetic circuits arise in the context of weighted logic programming languages, such as Datalog with aggregation, or Dyna. A weighted logic program defines a generalized arithmetic circuit— the weighted version of a proof forest, with nodes having arbitrary rather than boolean values. In this paper, we focus on finite circuits. We present a flexible algorithm for efficiently querying node val...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 2023
ISSN: ['0098-3500', '1557-7295']
DOI: https://doi.org/10.1145/3594632